Three–element Nonfinitely Axiomatizable Matrices

ثبت نشده
چکیده

In [2] W. Rautenberg proved that (the content of) any 2–element matrix is finitely axiomatizable and asked if the same is true for any finite matrix. This conjecture was disproved by P. Wojtylak, who in [5] (see also [4]) costructed a 5–element matrix with 2 designated elements, which is not finitely axiomatizable. Recently, W. Dziobiak presented in [1] a 4–element algebraic matrix (i.e. a matrix with one designated element) with the same property. His example and Rautenberg’s result mentioned above led Dziobiak to a natural question (also suggested by Wojtylak in [5]) whether nonfinitely axiomatizable matrices exist among the 3–element ones. In this note we give two such examples, both of which are algebraic. We also show that up to isomorphism these are the only nonfinitely axiomatizable 3– element algebraic matrices with one binary operation ◦ of which x◦(y◦z) is a tautology. This term is also a tautology of both Wojtylak’s and Dziobak’s matrices and plays an essential role in their proofs and also in the ours. We know nothing about the existence of nonfinitely axiomatizable matrices for which neither x◦(y◦z) nor (x◦y)◦z is a tautology. In our proof of nonfinite axiomatizability we are using the method of [4], [5] and [1] and we borrow some formulations from [1], [5] and [7]. Our language Λ is determined by an infinite set of variables

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inherently nonfinitely based lattices

We give a general method for constructing lattices L whose equational theories are inherently nonfinitely based. This means that the equational class (that is, the variety) generated by L is locally finite and that L belongs to no locally finite finitely axiomatizable equational class. We also provide an example of a lattice which fails to be inherently nonfinitely based but whose equational th...

متن کامل

A New Example of a Minimal Nonfinitely Based Semigroup

Only three of the 15 973 distinct six-element semigroups are presently known to be nonfinitely based. This paper introduces a fourth example. 2010 Mathematics subject classification: primary 20M07.

متن کامل

On the Finite Basis Problem for the Monoids of Triangular Boolean Matrices

Let T Bn denote the submonoid of all upper triangular boolean n×n matrices. It is shown by Volkov and Goldberg [6] that T Bn is nonfinitely based if n > 3, but the cases when n = 2, 3 remained open. In this paper, it is shown that the monoid T B2 is finitely based and a finite identity basis for the monoid T B2 is given. Moreover, it is shown that T B3 is inherently nonfinitely based. Hence T B...

متن کامل

Maximal Nonfinitely Generated Subalgebras

We show that “every countable algebra with a nonfinitely generated subalgebra has a maximal nonfinitely generated subalgebra” is provably equivalent to ’1-CA0 over RCA0.

متن کامل

Inherently Nonfinitely Based Solvable Algebras

We prove that an inherently nonfinitely based algebra cannot generate an abelian variety. On the other hand, we show by example that it is possible for an inherently nonfinitely based algebra to generate a strongly solvable variety.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007